Asymptotically optimal index policies for an abandonment queue with convex holding cost

نویسندگان

  • Maialen Larrañaga
  • Urtzi Ayesta
  • Maaike Verloop
چکیده

We investigate a resource allocation problem in a multi-class server with convex holding costs and user impatience under the average cost criterion. In general, the optimal policy has a complex dependency on all the input parameters and state information. Our main contribution is to derive index policies that can serve as heuristics and are shown to give good performance. Our index policy attributes to each class an index, which depends on the number of customers currently present in that class. The index values are obtained by solving a relaxed version of the optimal stochastic control problem and combining results from restless multi-armed bandits and queueing theory. They can be expressed as a function of the steady-state distribution probabilities of a one-dimensional birth-and-death process. For linear holding cost, the index can be calculated in closed-form and turns out to be independent of the arrival rates and the number of customers present. In the case of no abandonments and linear holding cost, our index coincides with the cμ-rule, which is known to be optimal in this simple setting. For general convex holding cost we derive properties of the index value in limiting regimes: we consider the behavior of the index (i) as the number of customers in a class grows large, which allows us to derive the asymptotic structure of the index policies, (ii) as the abandonment rate vanishes, which allows us to retrieve an index policy proposed for the multi-class M/M/1 queue with convex holding cost and no abandonments, and (iii) as the arrival rate goes to either 0 or ∞, representing light-traffic and heavy-traffic regimes, respectively. We show that Whittle’s index policy is asymptotically optimal in both light-traffic and heavy-traffic regimes. To obtain further insights into the index policy, we consider the fluid version of the relaxed problem and derive a closed-form expression for the fluid index. The latter is shown to coincide with the index values for the stochastic model in asymptotic regimes. For arbitrary convex holding cost the fluid index can be seen as the Gcμ/θ-rule, that is, including abandonments into the generalized cμ-rule (Gcμ-rule). Numerical experiments for a wide range of parameters have shown that the Whittle index policy and the fluid index policy perform very well for a broad range of parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The cμ/θ rule for many-server queues with abandonment

We consider a multi-class queueing system with multiple homogeneous servers and customer abandonment. For each customer class i, the holding cost per unit time, the service rate and the abandonment rate are denoted by ci, μi and θi, respectively. We prove that under a many-server fluid scaling and overload conditions, a routing policy that assigns priority to classes according to their index ci...

متن کامل

On scheduling a multiclass queue with abandonments under general delay costs

We consider a multiclass queueing system with abandonments and general delay costs. A system manager makes dynamic scheduling decisions to minimize long-run average delay and abandonment costs. We consider the three types of delay cost: (i) linear, (ii) convex, and (iii) convex–concave, where the last one corresponds to settings where customers may have a particular deadline in mind but once th...

متن کامل

Infinite horizon asymptotic average optimality for large-scale parallel server networks

We study infinite-horizon asymptotic average optimality for parallel server networks with multiple classes of jobs and multiple server pools in the Halfin–Whitt regime. Three control formulations are considered: 1) minimizing the queueing and idleness cost, 2) minimizing the queueing cost under a constraints on idleness at each server pool, and 3) fairly allocating the idle servers among differ...

متن کامل

Optimal Control of Service Rates in Networks of Queues

We prove a monotonicity result for the problem of optimal service rate control in certain queueing networks. Consider, as an illustrative example, a number of -/M/1 queues which are arranged in a cycle with some number of customers moving around the cycle. A holding cost hi(xi) is charged for each unit of time that queue i contains xi customers, with hi being convex. As a function of the queue ...

متن کامل

Restless Bandit Marginal Productivity Indices I: Single- Project Case and Optimal Control of a Make-to-stock M/g/1 Queue

Abstract This paper develops a framework based on convex optimization and economic ideas to formulate and solve by an index policy the problem of optimal dynamic effort allocation to a generic discrete-state restless bandit (i.e. binary-action: work/rest) project, elucidating a host of issues raised by Whittle (1988) ́s seminal work on the topic. Our contributions include: (i) a unifying definit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 81  شماره 

صفحات  -

تاریخ انتشار 2015